reducible procedure

См. также в других словарях:

• Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… …   Wikipedia

• Four color theorem — Example of a four colored map A four colori …   Wikipedia

• Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown …   Wikipedia

• Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… …   Wikipedia

• logic, history of — Introduction       the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic       There was a medieval tradition according to which the Greek philosopher …   Universalium

• Hermeneutics — Gadamer and Ricoeur G.B.Madison THE HISTORICAL BACKGROUND: ROMANTIC HERMENEUTICS Although the term ‘hermeneutics’ (hermeneutica) is, in its current usage, of early modern origin,1 the practice it refers to is as old as western civilization itself …   History of philosophy

• History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …   Wikipedia

• History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …   Wikipedia

• Turing degree — Post s problem redirects here. For the other Post s problem , see Post s correspondence problem. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic …   Wikipedia

• metaphysics — /met euh fiz iks/, n. (used with a sing. v.) 1. the branch of philosophy that treats of first principles, includes ontology and cosmology, and is intimately connected with epistemology. 2. philosophy, esp. in its more abstruse branches. 3. the… …   Universalium

• Phenomenology (The beginnings of) — The beginnings of phenomenology Husserl and his predecessors Richard Cobb Stevens Edmund Husserl was the founder of phenomenology, one of the principal movements of twentieth century philosophy. His principal contribution to philosophy was his… …   History of philosophy